Almost exact exchange at almost no computational cost in electronic structure
نویسندگان
چکیده
منابع مشابه
(Almost) No Label No Cry
In Learning with Label Proportions (LLP), the objective is to learn a supervised classifier when, instead of labels, only label proportions for bags of observations are known. This setting has broad practical relevance, in particular for privacy preserving data processing. We first show that the mean operator, a statistic which aggregates all labels, is minimally sufficient for the minimization...
متن کاملAlmost No-Scale Supergravity
We construct an explicit 5-dimensional supergravity model that realizes the ‘no scale’ mechanism for supersymmetry breaking with no unstable moduli. Supersymmetry is broken by a constant superpotential localized on a brane, and the radion is stabilized by Casimir energy from supergravity and massive hypermultiplets. If the standard model gauge and matter fields are localized on a brane, then vi...
متن کاملBNymble (a short paper) More anonymous blacklisting at almost no cost
Anonymous blacklisting schemes allow online service providers to prevent future anonymous access by abusive users while preserving the privacy of all anonymous users (both abusive and non-abusive). The first scheme proposed for this purpose was Nymble, an extremely efficient scheme based only on symmetric primitives; however, Nymble relies on trusted third parties who can collude to de-anonymiz...
متن کاملFault-tolerant almost exact state transmission
We show that a category of one-dimensional XY-type models may enable high-fidelity quantum state transmissions, regardless of details of coupling configurations. This observation leads to a fault-tolerant design of a state transmission setup. The setup is fault-tolerant, with specified thresholds, against engineering failures of coupling configurations, fabrication imperfections or defects, and...
متن کاملRanked Document Retrieval in (Almost) No Space
Ranked document retrieval is a fundamental task in search engines. Such queries are solved with inverted indexes that require additional 45%-80% of the compressed text space, and take tens to hundreds of microseconds per query. In this paper we show how ranked document retrieval queries can be solved within tens of milliseconds using essentially no extra space over an in-memory compressed repre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2015
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.92.022513